Using an isomorphic problem pair to learn introductory physics: Transferring from a two-step problem to a three-step problem
نویسندگان
چکیده
منابع مشابه
Two Step Swarm Intelligence to Solve the Feature Selection Problem
In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two stages. In the first step the agents build partial solutions which, are used as initial states in the second step. We have studied the performance of this new approach for the Feature Selection Problem by using Ant Colony ...
متن کاملA Review of Bush Encroachment in Namibia: From a Problem to an Opportunity?
Bush encroachment leads to land degradation in semiarid to arid regions. Over 45 million hectares of agricultural land in Namibia are affected. This is worrisome as nearly 70% of the Namibian population depends on agricultural activities and the beef industry is the mainstay of the farming communities. This study employed secondary data sources to provide a review of the problems and benefits o...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA Dual Simplex Algorithm for the Two-step Transportation Problem
An algorithm is developd from the associated generator trees of basic dual solutions of a two-step transportation problem. This is completely appropiate for the “Balinski signature method” for the obtention of prime solutions of the two-step transportation problem
متن کاملSingle-Step Quantum Search Using Problem Structure
The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem properties. The structure of random k-SAT allows determining the asymptotic average behavior of these algorithms, showing they improve on quantum algorithms, such as amplitude amplification, that ignor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Special Topics - Physics Education Research
سال: 2013
ISSN: 1554-9178
DOI: 10.1103/physrevstper.9.020114